Shortest-Path Routing in Arbitrary Networks
نویسندگان
چکیده
منابع مشابه
Shortest-Path Routing in Arbitrary Networks
We introduce an on-line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D+log N) steps, with high probability. This time bound is optimal up to the additive log N , and it has previously only been reached for bounded-degree leveled networks. Further, we show that the above bound holds also for random routing p...
متن کاملShortest Paths Routing in Arbitrary Networks
We introduce an on{line protocol which routes any set of N packets along shortest paths with congestion C and dilation D through an arbitrary network in O(C +D +log N) steps, with high probability. This time bound is optimal up to the additive log N, and it has previously only been reached for bounded{degree leveled networks. Further, we show that the above bound holds also for random routing p...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملLayered Shortest Path (LASH) Routing in Irregular System Area Networks
In recent years we have seen a growing interest in irregular network topologies for cluster interconnects. One problem related to such topologies is that the combination of shortest path and deadlock free routing is difficult. As a result of this the existing solutions for routing in irregular networks either guarantee shortest paths relative to some constraint (like up*/down*), or have to reso...
متن کاملEndhost-Based Shortest Path Routing in Dynamic Networks: Supporting Materials
Proof. The proof is based on a similar idea as in the proof of Theorem 3.1 in [2]: if we modify the link weights so that a competitive link becomes part of the optimal path and thus must be used most of the time by any good algorithm, then this link must be used sufficiently often (Ω(log T ) in T steps) by the same algorithm under the original link weights because we do not know which weight co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1999
ISSN: 0196-6774
DOI: 10.1006/jagm.1998.0980